Additive codes over $GF(4)$ from circulant graphs
نویسندگان
چکیده
In 2006, Danielsen and Parker [8] proved that every self-dual additive code over GF (4) is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.
منابع مشابه
Directed graph representation of half-rate additive codes over GF(4)
Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...
متن کاملAdditive circulant graph codes over GF ( 4 )
In this paper we consider additive circulant graph codes over GF(4) and an algorithm for their construction. Also, we present some new results obtained by
متن کاملSpectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...
متن کاملNew self-dual additive F4-codes constructed from circulant graphs
In order to construct quantum [[n, 0, d]] codes for (n, d) = (56, 15), (57, 15), (58, 16), (63, 16), (67, 17), (70, 18), (71, 18), (79, 19), (83, 20), (87, 20), (89, 21), (95, 20), we construct self-dual additive F4-codes of length n and minimum weight d from circulant graphs. The quantum codes with these parameters are constructed for the first time.
متن کاملGraph-based classification of self-dual additive codes over finite fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1403.7933 شماره
صفحات -
تاریخ انتشار 2014